| 翻訳と辞書 |
| Day and Night (cellular automaton) ： ウィキペディア英語版 |
Day and Night (cellular automaton)
Day and Night is a cellular automaton rule in the same family as Game of Life. It is defined by rule notation B3678/S34678, meaning that a dead cell becomes live (is born) if it has 3, 6, 7, or 8 live neighbors, and a live cell remains alive (survives) if it has 3, 4, 6, 7, or 8 live neighbors, out of the eight neighbors in the Moore neighborhood. It was invented and named by Nathan Thompson in 1997, and investigated extensively by David I. Bell. The rule is given the name "Day & Night" because its ''on'' and ''off'' states are symmetric: if all the cells in the Universe are inverted, the future states are the inversions of the future states of the original pattern. A pattern in which the entire universe consists of ''off'' cells except for finitely many ''on'' cells can equivalently be represented by a pattern in which the whole universe is covered in ''on'' cells except for finitely many ''off'' cells in congruent locations.
Although the detailed evolution of this cellular automaton is very different from Conway's Game of Life, it exhibits complex behavior similar to that rule: there are many known small ''oscillators'' and ''spaceships'', and ''guns'' formed by combining oscillators in such a way that they periodically emit spaceships of various types.
==References==
* . See also Bell's (Day & Night pattern archive ).
抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』
■ウィキペディアで「Day and Night (cellular automaton)」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|